Trellis-based search of the maximum a posteriori sequence using particle filtering
نویسندگان
چکیده
For a given computational complexity, the Viterbi algorithm applied on the discrete representation of the state space provided by a standard particle filtering, outperforms the particle filtering. However, the computational complexity of the Viterbi algorithm is still high. In this paper, we propose to use the M and T algorithms in order to reduce the computational complexity of the Viterbi algorithm and we show that these algorithms enable a reduction of the number of particles up to 20%, practically without loss of performance with respect to the Viterbi algorithm.
منابع مشابه
Maximum a posteriori sequence estimation using Monte Carlo particle filters
We develop methods for performing maximum a posteriori (MAP) sequence estimation in non-linear non-Gaussian dynamic models. The methods rely on a particle cloud representation of the filtering distribution which evolves through time using importance sampling and resampling ideas. MAP sequence estimation is then performed using a classical dynamic programming technique applied to the discretised...
متن کاملOn the convergence of two sequential Monte Carlo methods for maximum a posteriori sequence estimation and stochastic global optimization
This paper addresses the problem of maximum a posteriori (MAP) sequence estimation in general state-space models. We consider two algorithms based on the sequential Monte Carlo (SMC) methodology (also known as particle filtering). We prove that they produce approximations of the MAP estimator and that they converge almost surely. We also derive a lower bound for the number of particles that are...
متن کاملA Secure Chaos-Based Communication Scheme in Multipath Fading Channels Using Particle Filtering
In recent years chaotic secure communication and chaos synchronization have received ever increasing attention. Unfortunately, despite the advantages of chaotic systems, Such as, noise-like correlation, easy hardware implementation, multitude of chaotic modes, flexible control of their dynamics, chaotic self-synchronization phenomena and potential communication confidence due to the very dynami...
متن کاملMap Decoding of Arithmetic Codes with a Forbidden Symbol
In this paper, a novel maximum a posteriori (MAP) technique for the decoding of arithmetic codes in the presence of transmission errors is presented. Arithmetic codes with a forbidden symbol and trellis search techniques are employed in order to estimate the best transmitted codeword. The viability of the proposed approach is demonstrated in the binary symmetric channel case in terms of both pe...
متن کاملIIR System Identification Using Improved Harmony Search Algorithm with Chaos
Due to the fact that the error surface of adaptive infinite impulse response (IIR) systems is generally nonlinear and multimodal, the conventional derivative based techniques fail when used in adaptive identification of such systems. In this case, global optimization techniques are required in order to avoid the local minima. Harmony search (HS), a musical inspired metaheuristic, is a recently ...
متن کامل